Code-based Sequential Aggregate Signature Scheme

This paper proposes the first code-based quantum immune sequential aggregate signature (SAS) scheme and proves security of proposed in random oracle model. Aggregate (AS) schemes allow a group potential signers to sign different messages respectively, all signatures those users on can be aggregated into single such that size is much smaller than total individual signatures. Because aggregation many short signature, AS SAS reduce bandwidth save storage; moreover, when verified, not only valid but also order which each signer signed verified. applied traffic control, banking transaction military applications. Most existing are based either pairing or Rivest–Shamir–Adleman (RSA), hence, broken by Shor’s algorithm for Integer Factoring Problem (IFP) Discrete Logarithm (DLP). There no algorithms solve syndrome decoding problems. Hence, cryptography seen as one promising candidates post-quantum cryptography. shows how construct coding theory. Specifically, we our with code Courtois, Finiasz Sendrier (CFS). Compared CFS without aggregation, about 90% storage number asymptotically large.